Some Coloring Problems in Ramsey Theory
نویسنده
چکیده
In this thesis, we present new results which are concerned with the following four coloring problems in Ramsey Theory. i. The finite form of Brown’s Lemma. ii. Some 2-color Rado numbers. iii. Ramsey results involving Fibonacci sequences. iv. Coloring the odd-distance plane graph. A few of the results in this thesis are cited from earlier works of other authors. Several results are cited from papers co-authored by the present author. All other results are new.
منابع مشابه
On the Size-Ramsey Number of Hypergraphs
The size-Ramsey number of a graph G is the minimum number of edges in a graph H such that every 2-edge-coloring of H yields a monochromatic copy of G. Size-Ramsey numbers of graphs have been studied for almost 40 years with particular focus on the case of trees and bounded degree graphs. We initiate the study of size-Ramsey numbers for k-uniform hypergraphs. Analogous to the graph case, we cons...
متن کاملZarankiewicz Numbers and Bipartite Ramsey Numbers
The Zarankiewicz number z(b; s) is the maximum size of a subgraph of Kb,b which does not contain Ks,s as a subgraph. The two-color bipartite Ramsey number b(s, t) is the smallest integer b such that any coloring of the edges of Kb,b with two colors contains a Ks,s in the rst color or a Kt,t in the second color.In this work, we design and exploit a computational method for bounding and computing...
متن کاملLocal k-colorings of graphs and hypergraphs
A local k-coloring of a graph is a coloring of its edges in such a way that each vertex is incident to edges of at most k different colors. We investigate the similarities and differences between usual and local k-colorings, and the results presented in the paper give a general insight to the nature of local colorings. We are mainly concerned with local variants of Ramsey-type problems, in part...
متن کاملOn globally sparse Ramsey graphs
We say that a graph G has the Ramsey property w.r.t. some graph F and some integer r ≥ 2, or G is (F, r)-Ramsey for short, if any r-coloring of the edges of G contains a monochromatic copy of F . Rödl and Ruciński asked how globally sparse (F, r)-Ramsey graphs G can possibly be, where the density of G is measured by the subgraph H ⊆ G with the highest average degree. So far, this so-called Rams...
متن کاملGraphs and Partially Ordered Sets: Recent Results and New Directions
We survey some recent research progress on topics linking graphs and finite partially ordered sets. Among these topics are planar graphs, hamiltonian cycles and paths, graph and hypergraph coloring, on-line algorithms, intersection graphs, inclusion orders, random methods and ramsey theory. In each case, we discuss open problems and future research directions.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011